Graph-wreath products and finiteness conditions

Graph-wreath products and finiteness conditionsI

A notion of graph-wreath product of groups is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type Fn. Under various additional assumptions we show that these conditions are necessary. Our results generalize results of Bartholdi, Cornulier and Kochloukova about wreath products. Graphwreath products of groups include class...

On Finite Generation and Other Finiteness Conditions for Wreath Products of Semigroups

On the Absence of Cohomological Finiteness in Wreath Products

The wreath product W = A i T, where A ^ 1, is of type FP2 if and only if T is finite and A is of type FP2. 1991 Mathematics subject classification (Amer. Math. Soc): primary 20E22, 20F05, 20J05.

Coupled Cells: Wreath Products and Direct Products

In this note we discuss the structure of systems of coupled cells (which we view as systems of ordinary differential equations) where symmetries of the system are obtained through the group G of global permutations of the cells and the group L of local internal symmetries of the dynamics in each cell. We show that even when the cells are assumed to be identical with identical coupling, the way ...

The Wreath Products